Braess' paradox: A cooperative game‐theoretic point of view

نویسندگان

چکیده

Braess' paradox is a classical result in the theory of congestion games. It motivates theoretically why adding resource (e.g., an arc) to network may sometimes worsen, rather than improve, overall performance. Differently from previous literature, which studies non-cooperative game-theoretic setting, this work, framework proposed investigate its occurrence by exploiting cooperative games with transferable utility (TU games) on networks. In way, instead focusing marginal contribution provided insertion arc when single initial scenario considered, average respect various scenarios, that is, Shapley value suitably-defined TU game, evaluated. shown that, for choices function game modeling congestion, there are cases associated negative, meaning negative.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Collective Intelligence and Braess' Paradox

We consider the use of multi-agent systems to control network routing. Conventional approaches to this task are based on Ideal Shortest Path routing Algorithm (ISPA), under which at each moment each agent in the network sends all of its traffic down the path that will incur the lowest cost to that traffic. We demonstrate in computer experiments that due to the sideeffects of one agent’s actions...

متن کامل

Braess' Paradox in a Generalised Traffic Network

The classical network configuration introduced by Braess in 1968 is of fundamental significance because Valiant and Roughgarden showed in 2006 that ‘the “global” behaviour of an equilibrium flow in a large random network is similar to that in Braess’ original four-node example’. In this paper, a natural generalisation of Braess’ network is introduced and conditions for the occurrence of Braess’...

متن کامل

Braess Paradox in Non-Cooperative Dynamic Load Balancing For the Cohen-Kelly Computer Network Model

---------------------------------------------ABSTRACT-----------------------------------------We consider a distributed computer system in Wardrop equilibrium, i.e., situations where no user can reduce its own response time by unilaterally choosing another path, if all the other users retain their present paths. The Braess paradox is a famous example of paradoxical cases where adding capacity t...

متن کامل

Avoiding Braess' Paradox through Collective Intelligence

In an Ideal Shortest Path Algorithm (ISPA), at each moment each router in a network sends all of its traffic down the path that will incur the lowest cost to that traffic. In the limit of an infinitesimally small amount of traffic for a particular router, its routing that traffic via an ISPA is optimal, as far as cost incurred by that traffic is concerned. We demonstrate though that in many cas...

متن کامل

Matroids Are Immune to Braess' Paradox

The famous Braess paradox describes the following phenomenon: It might happen that the improvement of resources, like building a new street within a congested network, may in fact lead to larger costs for the players in an equilibrium. In this paper we consider general nonatomic congestion games and give a characterization of the maximal combinatorial property of strategy spaces for which Braes...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Networks

سال: 2021

ISSN: ['0028-3045', '1097-0037']

DOI: https://doi.org/10.1002/net.22018